Exploiting Probabilistic Independence for Permutations: Proofs
نویسندگان
چکیده
The multiplicities in the decomposition (Equation 0.1) are equivalent to the famousLittlewood-Richardson coe cients, 1 and in this appendix, we describe a result known as the Littlewood-Richardson (LR) rule which will allow us to compute the Littlewood-Richardson coe cients tractably (at least for low-order terms). There are several methods for computing these numbers (see [Knutson and Tao, 1999, Vakil, 2006], for example) but it is known ([Narayanan, 2006]) that, in general, the problem of computing the LittlewoodRichardson coe cients is #P -hard in general, and as we will see, involves enumerating the integer feasible points of a linearly constrained polytope.
منابع مشابه
Exploiting Probabilistic Independence for Permutations
Permutations are ubiquitous in many real world problems, such as voting, rankings and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities. Recent Fourier-based approaches can be used to provide a compact representation over low-frequency components of the distribution. Though polynomial, the complexity of these representations grows very...
متن کاملexploiting structural decompositions of the symmetric group jonathan huang cmu - ri - tr - 11 - 28 Submitted in partial fulfillment of the requirements for the degree
Probabilistic reasoning and learning with permutation data arises as a fundamental problem in myriad applications such as modeling preference rankings over objects (such as webpages), tracking multiple moving objects, reconstructing the temporal ordering of events from multiple imperfect accounts, and more. Since the number of permutations scales factorially with the number of objects being ran...
متن کاملUncovering the Riffled Independence Structure of Rankings
Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of n objects scales factorially in n. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impose strong sparsity constraints on distributions and are unsuitable for modeling r...
متن کاملProving uniformity and independence by self-composition and coupling
Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains. More recently, couplings have been investigated as a useful abstraction for formal reasoning about relational properties of probabilistic programs, in particular for modeling reduction-based cryptographic proofs a...
متن کاملUncovering the riffled independence structure of ranked data
Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of n objects scales factorially in n. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impose strong sparsity constraints on distributions and are unsuitable for modeling r...
متن کامل